Diffie–Hellman problem - PDFSEARCH.IO - Document Search Engine

Diffie–Hellman problem
Results: 86

#	Item
31	CS355: Topics in cryptography Spring 2014 Assignment #1 Due: Tuesday, May. 13, 2014. Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2014-05-07 00:53:37 Finite fields Cryptographic protocols Computational hardness assumptions Public-key cryptography Diffie–Hellman problem Diffie–Hellman key exchange Digital signature PP One-way function Cryptography Abstract algebra Mathematics
32	CS255: Cryptography and Computer Security Winter 2005 Assignment #3 Due: Monday, Feb. 28th, 2004. Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2005-02-22 17:09:50 Cryptographic protocols Electronic commerce Diffie–Hellman key exchange XTR ElGamal encryption RSA Discrete logarithm Diffie–Hellman problem Commitment scheme Cryptography Finite fields Public-key cryptography
33	CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2007-01-06 01:59:49 Cryptographic protocols Electronic commerce Computational hardness assumptions RSA Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm Schmidt–Samoa cryptosystem Paillier cryptosystem Cryptography Public-key cryptography Finite fields
34	CS255: Cryptography and Computer Security Winter 2003 Assignment #3 Due: Monday, March 3rd, 2003 at 5pm in CS255 box next to Gates 182. Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2003-02-18 23:13:10 Finite fields Computational hardness assumptions Diffie–Hellman key exchange ElGamal encryption XTR RSA Diffie–Hellman problem Computational Diffie–Hellman assumption Discrete logarithm Cryptography Public-key cryptography Cryptographic protocols
35	CS255: Cryptography and Computer Security Winter 2002 Assignment #3 Due: Friday, March 8th, 2002 at 5pm. Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2002-03-05 19:45:19 Computational hardness assumptions Electronic commerce Cryptographic protocols RSA Diffie–Hellman key exchange ElGamal encryption XTR Diffie–Hellman problem Computational Diffie–Hellman assumption Cryptography Public-key cryptography Finite fields
36	CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2005-01-04 13:22:38 Cryptographic protocols Electronic commerce Computational hardness assumptions RSA Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm Schmidt–Samoa cryptosystem Paillier cryptosystem Cryptography Public-key cryptography Finite fields
37	A quantum-safe circuit-extension handshake for Tor John Schanck1,2 , William Whyte1 , and Zhenfei Zhang1 1 Security Innovation, Wilmington, MA[removed]University of Waterloo, Waterloo, Canada Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-03-26 06:52:05 Elliptic curve Diffie–Hellman Public-key cryptography Diffie–Hellman problem Cryptography Cryptographic protocols Diffie–Hellman key exchange
38	Pairing-Based Identification Schemes Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2008-06-06 19:27:43 Public-key cryptography Finite fields BLS Computational Diffie–Hellman assumption Diffie–Hellman problem Decisional Diffie–Hellman assumption Diffie–Hellman key exchange Zero-knowledge proof Digital signature Cryptography Computational hardness assumptions Cryptographic protocols
39	CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2006-01-11 14:38:17 Cryptographic protocols Electronic commerce Computational hardness assumptions RSA Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm Schmidt–Samoa cryptosystem Paillier cryptosystem Cryptography Public-key cryptography Finite fields
40	3 Countermeasures Against Information Leakage 3-1 Subgroup Membership Problem and Its Applications to Information Security YAMAMURA Akihiro and SAITO Taiichi The widely used algorithmic problems, the quadratic residue pr Add to Reading List Source URL: www.nict.go.jp Language: English - Date: 2013-11-21 18:57:32 Group theory Decisional Diffie–Hellman assumption Pseudorandom generator theorem Order Commitment scheme Probabilistic encryption XTR Sylow theorems Abstract algebra Cryptography Mathematics

UPDATE